Change-Point Estimation Using New Minimum Message Length Approximations

نویسندگان

  • Leigh J. Fitzgibbon
  • David L. Dowe
  • Lloyd Allison
چکیده

This paper investigates the coding of change-points in the information-theoretic Minimum Message Length (MML) framework. Changepoint coding regions affect model selection and parameter estimation in problems such as time series segmentation and decision trees. The Minimum Message Length (MML) and Minimum Description Length (MDL78) approaches to change-point problems have been shown to perform well by several authors. In this paper we compare some published MML and MDL78 methods and introduce some new MML approximations called ‘MMLDc’ and ‘MMLDF’. These new approximations are empirically compared with Strict MML (SMML), Fairly Strict MML (FSMML), MML68, the Minimum Expected Kullback-Leibler Distance (MEKLD) loss function and MDL78 on a tractable binomial changepoint problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bayesian Posterior Comprehension via Message from Monte Carlo

We discuss the problem of producing an epitome, or brief summary, of a Bayesian posterior distribution and then investigate a general solution based on the Minimum Message Length (MML) principle. Clearly, the optimal criterion for choosing such an epitome is determined by the epitome’s intended use. The interesting general case is where this use is unknown since, in order to be practical, the c...

متن کامل

Minimum Message Length Shrinkage Estimation

This note considers estimation of the mean of a multivariate Gaussian distribution with known variance within the Minimum Message Length (MML) framework. Interestingly, the resulting MML estimator exactly coincides with the positive-part JamesStein estimator under the choice of an uninformative prior. A new approach for estimating parameters and hyperparameters in general hierarchical Bayes mod...

متن کامل

Univariate Polynomial Inference by Monte Carlo Message Length Approximation

We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partitions the posterior sample into sets of regions that contain similar models. Each region has an associated message length (given by Dowe’s MMLD approximation) and a point estimate that is representative of models in the ...

متن کامل

MML is not consistent for Neyman-Scott

Minimum Message Length (MML) is a popular method for statistical inference, belonging to the Minimum Description Length (MDL) family. It is a general name for any of several computationally-feasible approximations to the generally NP-Hard Strict Minimum Message Length (SMML) estimator. One often-cited showcase for the power of MML is the Neyman-Scott estimation problem, where most popular estim...

متن کامل

Minimum Message Length Inference and Parameter Estimation of Autoregressive and Moving Average Models

This technical report presents a formulation of the parameter estimation and model selection problem for Autoregressive (AR) and Moving Average (MA) models in the Minimum Message Length (MML) framework. In particular, it examines suitable priors for both classes of models, and subsequently derives message length expressions based on the MML87 approximation. Empirical results demonstrate the new...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002